On global offensive k-alliances in graphs
نویسندگان
چکیده
We investigate the relationship between global offensive k-alliances and some characteristic sets of a graph including r-dependent sets, τ dominating sets and standard dominating sets. In addition, we discuss the close relationship that exist among the (global) offensive ki-alliance number of Γi, i ∈ {1, 2} and the (global) offensive k-alliance number of Γ1×Γ2, for some specific values of k. As a consequence of the study, we obtain bounds on the global offensive k-alliance number in terms of several parameters of the graph. e-mail:[email protected]. Partially supported by Ministerio de Ciencia y Tecnoloǵıa, ref. BFM2003-00034 and Junta de Andalućıa, ref. FQM-260 and ref. P06-FQM-02225. e-mail:[email protected]. Partially supported by the Spanish Ministry of Education through projects TSI2007-65406-C03-01 “E-AEGIS” and CONSOLIDER CSD2007-00004 “ARES” and by the Rovira i Virgili University through project 2006AIRE-09 e-mail:[email protected] e-mail: [email protected]
منابع مشابه
On global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملGlobal Offensive Alliances in Graphs via Degree Sequences
A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.
متن کاملGlobal O ensive Alliances in Graphs via Degree Sequences
A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.
متن کاملConnected global offensive k-alliances in graphs
We consider finite graphs G with vertex set V (G). For a subset S ⊆ V (G), we define by G[S] the subgraph induced by S. By n(G) = |V (G)| and δ(G) we denote the order and the minimum degree of G, respectively. Let k be a positive integer. A subset S ⊆ V (G) is a connected global offensive k-alliance of the connected graphG, ifG[S] is connected and |N(v)∩S| ≥ |N(v)−S|+k for every vertex v ∈ V (G...
متن کاملBoundary powerful k-alliances in graphs
A global boundary defensive k-alliance in a graph G = (V,E) is a dominating set S of vertices of G with the property that every vertex in S has k more neighbors in S than it has outside of S. A global boundary offensive k-alliance in a graph G is a set S of vertices of G with the property that every vertex in V − S has k more neighbors in S than it has outside of S. We define a global boundary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 23 شماره
صفحات -
تاریخ انتشار 2010